MEGA From Proof Planning towards Mathematical Knowledge Management
نویسندگان
چکیده
Higher Order Natural Deduction Proof Object Maintenance of proof developments at different layers of granularity which are connected to each other September 25th, 2003 – p.7 Source: Autexier, Benzmüller Proof Data Structure MEGA Main References [CheikhrouhouSorge-ACIDCA-00] Overview on PDS [SiekmannEtAl-35yAutomath] Working with PDS Discussion + Support for proof development at different levels of granularity, proof expansion and contraction, non-soundness and verification − Missing: support for change of representation language New Directions ⇒ A PDS for different levels of granularity and representational abstraction [AutexierBenmüllerHutter-SEKI-03] September 25th, 2003 – p.7 Source: Autexier, Benzmüller Proof Verbalization MEGA P.REX (successor of PROVERB): lifting of proofs in the PDS to assertion level macro-planning text structure micro-planning sentence structure and linguistic realization generation of natural language representation pre-required: linguistic knowledge user-adaptive proof explanation September 25th, 2003 – p.8 Source: Autexier, BenzmüllerProof VerbalizationMEGA Main References[Huang-CADE-94]PROVERB, Assertion Level[Fiedler-IJCAR-01, Fiedler-PhD-01]P.REX, proof explanationDiscussion+ Flexible, adaptable, non-template based proof verbalization− Missing: Full natural language DIALOG at assertion levelNew Directions⇒ DIALOG project (see 2nd part of talk and talk on ’Assertionlevel proofs with under-specification’) September 25th, 2003 – p.8 Source: Autexier, BenzmüllerUser InterfaceMEGA September 25th, 2003 – p.9 Source: Autexier, BenzmüllerUser InterfaceMEGA Main References[SiekmannEtAl-99]LOUI: Lovely OMEGA User Interface Discussion+ Support for different (connected) views on proof developments:linearized ND style, proof tree (PDS), natural language−What do users really want to see? Which users?− Missing: optimal, integrated support for other mathematicalactivities such as publication, authoring, modeling, etc. September 25th, 2003 – p.9 Source: Autexier, BenzmüllerMathematical KnowledgeMEGA
منابع مشابه
Semantically Guided Mega Proof Planner Semantically Guided Mega Proof Planner
Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning takes a diierent perspective and uses semantic information as search control heuristics. In thi...
متن کاملA multi-modi Proof Planner
Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical eld. This paradigm is adopted in the mega proof development system, to provide support for the user. A considerable part of the proof construction and even sometimes the whole work can be u...
متن کاملPlanning Diagonalization Proofs
Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical eld. The diagonalization proof technique is a well-known method in theoretical computer science and in mathematics that originated with Can-tor, who used it to show his seminal uncountabili...
متن کاملComputer Supported Mathematics with ΩMEGA
Classical automated theorem proving of today is based on ingenious search techniques to find a proof for a given theorem in very large search spaces—often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to mor...
متن کاملHeavy-Tailed Behavior and Randomization in Proof Planning
Proof Planning Proof planning considers mathematical theorems as planning problems. A proof planning problem is defined by an initial state specified by the proof assumptions, the goal state given by the theorem to be proved, and a set of planning operators called methods. Finding a proof corresponds therefore to searching for a sequence of planning operators that derive the theorem from the as...
متن کامل